3-layer 2.5D Metabolic pathway layout algorithm
نویسندگان
چکیده
منابع مشابه
A graph layout algorithm for drawing metabolic pathways
MOTIVATION A large amount of data on metabolic pathways is available in databases. The ability to visualise the complex data dynamically would be useful for building more powerful research tools to access the databases. Metabolic pathways are typically modelled as graphs in which nodes represent chemical compounds, and edges represent chemical reactions between compounds. Thus, the problem of v...
متن کامل3-D Fixture Layout Design System Based on Genetic Algorithm
Designing a fixture layout is the primary task of fixture design, which consists of determining the different combinations of locators and clamping scheme. Designing a fixture is a lengthy process and the performance of a fixture is usually difficult to predict. Designing fixture to effectively restrain complex components has been recognised as a bottleneck in fixture design development. The ai...
متن کاملApplying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کاملMetabolic Pathway Modeling by Using the Nearest Neighbor Algorithm
A new computational approach was developed for modeling the metabolic pathways. The new approach is featured by combing the knowledge of gene ontology, microarray, and chemical functional group to formulate the enzyme-substrate/product couples in a 1,660 vector space. The nearest neighbor algorithm was used to perform the prediction of the networking relationship occurring in the metabolic path...
متن کاملOptimization of Fabric Layout by Using Imperialist Competitive Algorithm
In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2013
ISSN: 1598-849X
DOI: 10.9708/jksci.2013.18.6.071